A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks

A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile nodes forming a temporary network without the use of any existing infrastructure or centralized administration. Due to the dynamic topology of the network and the resource constraints, implementing distributed algorithms in MANETs is a challenging task. This paper proposes a new architecture to solve the problem of mutual exclusion for MANETs. The architecture is structured into two layers: (i) a service layer that contains a distributed mutual exclusion algorithm and (ii) a network layer that includes two routing protocols. The routing protocols are chosen in order to reduce the number of hops traversed and the number of application messages exchanged per Critical Section (CS) access. The experimental results show the effectiveness of our architecture, especially when the mobility increases. Key-Words. Ad Hoc mobile networks, distributed mutual exclusion algorithm, routing protocols, Direct Acyclic Graph.